Hierarchical parallelisation strategy for multilevel fast multipole algorithm in computational electromagnetics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solutions of large-scale electromagnetics problems involving dielectric objects with the parallel multilevel fast multipole algorithm.

Fast and accurate solutions of large-scale electromagnetics problems involving homogeneous dielectric objects are considered. Problems are formulated with the electric and magnetic current combined-field integral equation and discretized with the Rao-Wilton-Glisson functions. Solutions are performed iteratively by using the multilevel fast multipole algorithm (MLFMA). For the solution of large-...

متن کامل

Efficient Preconditioning Strategies for the Multilevel Fast Multipole Algorithm

For the iterative solutions of the integral equation methods employing the multilevel fast multipole algorithm (MLFMA), effective preconditioning techniques should be developed for robustness and efficiency. Preconditioning techniques for such problems can be broadly classified as fixed preconditioners that are generated from the sparse near-field matrix and variable ones that can make use of M...

متن کامل

Computational Electromagnetic Analysis of Deformed Nanowires Using the Multilevel Fast Multipole Algorithm

We consider computational analysis of deformed nanowires and their arrays using a full-wave simulation environment based on integral-equation formulations and the multilevel fast multipole algorithm (MLFMA). Without requiring any periodicity assumptions, MLFMA allows for fast and accurate simulations of complex nanowire structures with three-dimensional geometries and random deformations. We pr...

متن کامل

Using Fast Fourier Transform in the 3-d Multilevel Fast Multipole Algorithm

In this paper a method is presented how to perform interpolation and anterpolation in both spherical coordinates θ and φ by trigonometric polynomials and the fast Fourier transform (FFT) in the 3-D multilevel fast multipole algorithm (MLFMA). The proposed method is exact in interpolation and anterpolation, and has the high numerical efficiency of FFT. A numerical comparison suggests that the pr...

متن کامل

Multilevel Fast Multipole Algorithmfor Solving Combined Field

The fast multipole method (FMM) has been implemented to speed up the matrix-vector multiply when an iterative method is used to solve combined eld integral equation (CFIE). FMM reduces the complexity from O(N 2) to O(N 1:5). With a multilevel fast multipole algorithm (MLFMA), it is further reduced to O(NlogN). A 110,592 unknown problem can be solved within 24 hours on a SUN Sparc10.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics Letters

سال: 2008

ISSN: 0013-5194

DOI: 10.1049/el:20082282